On Grid Quorums for Erasure Coded Data
نویسندگان
چکیده
منابع مشابه
Billiard Quorums on the Grid
Maekawa considered a simple but suboptimal grid based quorum generation scheme in which N sites in a network are logically organized in the form of a p N p N grid, and the quorum sets are row-column pairs. Even though the quorum size 2 p N of the grid scheme is twice as large as nite projective plane based optimal size quorums, it has the advantage of being simple and geometrically evident. In ...
متن کاملEfficient consistency for erasure-coded data via versioning servers
This paper describes the design, implementation and performance of a family of protocols for survivable, decentralized data storage. These protocols exploit storage-node versioning to efficiently achieve strong consistency semantics. These protocols allow erasure-codes to be used that achieve network and storage efficiency (and optionally data confidentiality in the face of server compromise). ...
متن کاملMist : Efficient Dissemination of Erasure-coded Data in Data Centers
Data centers store a massive amount of data in a large number of servers built by commodity hardware. To maintain data integrity against server failures, erasure codes have been extensively deployed in modern data centers to provide a higher level of failure tolerance with less storage overhead than replication. Yet, compared to replication, disseminating erasure-coded data from a source server...
متن کاملRepair Pipelining for Erasure-Coded Storage
We propose repair pipelining, a technique that speeds up the repair performance in general erasure-coded storage. By pipelining the repair of failed data in small-size units across storage nodes, repair pipelining reduces the repair time to approximately the same as the normal read time to the same amount of data in homogeneous environments. We further extend repair pipelining for heterogeneous...
متن کاملByzantine-tolerant erasure-coded storage
This paper describes a decentralized consistency protocol for survivable storage that exploits data versioning within storage-nodes. Versioning enables the protocol to efficiently provide linearizability and wait-freedom of read and write operations to erasure-coded data in asynchronous environments with Byzantine failures of clients and servers. Exploiting versioning storage-nodes, the protoco...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Entropy
سال: 2021
ISSN: 1099-4300
DOI: 10.3390/e23020177